Confluence via strong normalisation in an algebraic lambda-calculus with rewriting
نویسندگان
چکیده
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear-algebraic λ -calculus enforcing strong normalisation, which gives back confluence. The type system allows an abstract interpretation in System F.
منابع مشابه
On Modular Properties of Higher Order Extensional Lambda Calculi
We prove that confluence and strong normalisation are both modular properties for the addition of algebraic term rewriting systems to Girard’s F! equipped with either -equality or -equality. The key innovation is the use of -expansions over the more traditional -contractions. We then discuss the difficulties encountered in generalising these results to type theories with dependent types. Here c...
متن کاملMilner’s Lambda-Calculus with Partial Substitutions
We study Milner’s lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of β-strong normalisation and characterisation of strongly normalisable terms via an intersection typing discipline. The results on terms transfer to Milner’s bigraphical model of the calculus. We relate Milner’s calculus to calculi with definitions, to explicit su...
متن کاملResource operators for λ-calculus
We present a simple term calculus with an explicit control of erasure and duplication of substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment of Linear Logic’s proof-nets. We show the operational behaviour of the calculus and some of its fundamental properties such as confluence, preservation of strong normalisation, strong normalisation of simply-typed t...
متن کاملCombining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints
It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for η, or recursion together with the usual contraction rule for surjective pairing. We show that confluence and strong normalization are modular prop...
متن کاملA Theory of Explicit Substitutions with Safe and Full Composition
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part of this paper. Then, very simple technology in named variable-style notation is used to establish a theory of explicit substitutions for the lambd...
متن کامل